本文研究了带有资源约束的两台机器流水作业中的最小排序长度问题,并证明了[4,5]中提出的F2|pmtn、res 111|C_(max)是强NP—困难的......

Given a complete graph with vertex set X and subsets X1,X2,...,Xn, the problem of finding a subgraph G with minimum numb......